Line Iterative Methods for Cyclically Reduced Discrete Convection-Diffusion Problems

نویسندگان

  • Howard C. Elman
  • Gene H. Golub
چکیده

An analytic and empirical study of line iterative methods for solving the discrete convection-diffusion equation is performed. The methodology consists of performing one step of the cyclic reduction method, followed by iteration on the resulting reduced system using line orderings of the reduced grid. Two classes of iterative methods are considered: block stationary methods, such as the block Gauss-Seidel and SOR methods, and preconditioned generalized minimum residual methods with incomplete LU preconditioners. New analysis extends convergence bounds for constant coefficient problems to problems with separable variable coefficients. In addition, analytic results show that iterative methods based on incomplete LU preconditioners have faster convergence rates than block Jacobi relaxation methods. Numerical experiments examine additional properties of the two classes of methods, including the effects of direction of flow, discretization, and grid ordering on performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Solution of the Convection-Diffusion Equation by Iteration

The discretization of the two-dimensional convection-diffusion equation usually leads to a linear system whose matrix coefficient is block two-cyclic consistently ordered. For the solution of the resulting linear system, several efficient stationary iterative methods were proposed, among others, by Chin and Manteuffel (1988), Elman and Golub (1990), de Pillis (1991) and Eiermann, Niethammer and...

متن کامل

EditionOn the convergence of line iterative methodsfor cyclically reduced non - symmetrizable linearsystemsHoward

We derive analytic bounds on the convergence factors associated with block relaxation methods for solving the discrete two-dimensional convection-diiusion equation. The analysis applies to the reduced systems derived when one step of block Gaussian elimination is performed on red-black ordered two-cyclic discretizations. We consider the case where centered nite diierence discretiza-tion is used...

متن کامل

Preconditioning Techniques for Reduced Basis Methods for Parameterized Partial Differential

The reduced basis methodology is an efficient approach to solve parameterized discrete partial differential equations when the solution is needed at many parameter values. An offline step approximates the solution space and an online step utilizes this approximation, the reduced basis, to solve a smaller reduced problem, which provides an accurate estimate of the solution. Traditionally, the re...

متن کامل

Preconditioning Techniques for Reduced Basis Methods for Parameterized Elliptic Partial Differential Equations

The reduced basis methodology is an efficient approach to solve parameterized discrete partial differential equations when the solution is needed at many parameter values. An offline step approximates the solution space, and an online step utilizes this approximation, the reduced basis, to solve a smaller reduced problem, which provides an accurate estimate of the solution. Traditionally, the r...

متن کامل

Non-self-adjoint Linear Systems

We study iterative methods for solving linear systems of the type arising from two-cyclic discretizations of non-self-adjoint two-dimensional elliptic partial differential equations. A prototype is the convection-diffusion equation. The methods consist of applying one step of cyclic reduction, resulting in a "reduced system" of half the order of the original discrete problem, combined with a re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1992